Parallel and Serial Methods of Pattern Matching

نویسندگان

  • D. J. Willshaw
  • P. Buneman
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and Kinematic Analysis of a 4-DOF Serial-Parallel Manipulator for a Driving Simulator

This paper presents the kinematic analysis and the development of a 4-degree-of-freedom serial-parallel mechanism for large commercial vehicle driving simulators. The degrees of freedom are selected according to the target maneuvers and the structure of human motion perception organs. Several kinematic properties of parallel part of the mechanism under study are investigated, including the inve...

متن کامل

A Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver

In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...

متن کامل

An Intelligent Computer Interface Utilizing Parallel Picocontrollers (TECHNICAL NOTE)

The design of an interface unit is described, in which RS232 serial data is converted to latched parallel data on 22 independent lines. The data direction of each line is programmable through the serial port. Two picocontrollers are employed in a parallel processing mode to give the required number of I/O pins, and data on the shared serial line is coded to separate data streams to the individu...

متن کامل

Efficient Parallel And Serial Approximate String Matching

Consider the string matching problem, where differences between characters of the pattern and characters of the text are allowed. Each difference is due to either a mismatch between a character of the text and a character of the pattern or a superfluous character in the text or a superfluous character in the pattern. Given a text of length n, a pattern of length m and an integer k, we present p...

متن کامل

High Level Synthesis of SPARQL queries

Resource Description Framework (RDF) databases naturally maps to labeled, directed graphs. SPARQL is a query language for RDF databases that expresses queries as graph pattern matching operations. GEMS is a RDF database that, differently from other solutions, employs graph methods at all levels of its stack. Graph methods are inherently task parallel, but they exhibit an irregular behavior. In ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013